Interpolation Theorems, Lower Bounds for Proof Systems, and Independence Results for Bounded Arithmetic
نویسنده
چکیده
A proof of the (propositional) Craig interpolation theorem for cut-free sequent calculus yields that a sequent with a cut-free proof (or with a proof with cut-formulas of restricted form; in particular, with only analytic cuts) with k inferences has an interpolant whose circuit-size is at most k. We give a new proof of the interpolation theorem based on a communication complexity approach which allows a similar estimate for a larger class of proofs. We derive from it several corollaries: 1. Feasible interpolation theorems for the following proof systems: (a) resolution. (b) a subsystem of LK corresponding to the bounded arithmetic theory S 2 2 (). (c) linear equational calculus. (d) cutting planes. 2. New proofs of the exponential lower bounds (for new formulas) (a) for resolution ((15]). (b) for the cutting planes proof system with coeecients written in unary ((4]). 3. An alternative proof of the independence result of 43] concerning the provability of circuit-size lower bounds in the bounded arithmetic theory S 2 2 (). 1 In the other direction we show that a depth 2 subsystem of LK does not admit feasible monotone interpolation theorem (the so called Lyndon theorem), and that a feasible monotone interpolation theorem for the depth 1 subsystem of LK would yield new exponential lower bounds for resolution proofs of the weak pigeonhole principle.
منابع مشابه
Bounded Arithmetic, Cryptography and Complexity
This survey discusses theories of bounded arithmetic, growth rates of definable functions, natural proofs, interpolation theorems, connections to cryptography, and the difficulty of obtaining independence results.
متن کاملOn Interpolation and Automatization for Frege
The interpolation method has been one of the main tools for proving lower bounds for propositional proof systems. Loosely speaking, if one can prove that a particular proof system has the feasible interpolation property, then a generic reduction can (usually) be applied to prove lower bounds for the proof system, sometimes assuming a (usually modest) complexity-theoretic assumption. In this pap...
متن کاملOn Interpolation and Automatization for Frege Systems
The interpolation method has been one of the main tools for proving lower bounds for propositional proof systems. Loosely speaking, if one can prove that a particular proof system has the feasible interpolation property, then a generic reduction can (usually) be applied to prove lower bounds for the proof system, sometimes assuming a (usually modest) complexity-theoretic assumption. In this pap...
متن کاملNo Feasible Interpolation for TC0-Frege Proofs
The interpolation method has been one of the main tools for proving lower bounds for propositional proof systems. Loosely speaking, if one can prove that a particular proof system has the feasible interpolation property, then a generic reduction can (usually) be applied to prove lower bounds for the proof system, sometimes assuming a (usually modest) complexity-theoretic assumption. In this pap...
متن کاملUnprovability of Lower Bounds on Circuit Size in Certain Fragments of Bounded Arithmetic
We show that if strong pseudorandom generators exist then the statement “α encodes a circuit of size n(log ∗ n) for SATISFIABILITY” is not refutable in S2 2(α). For refutation in S1 2(α), this is proven under the weaker assumption of the existence of generators secure against the attack by small depth circuits, and for another system which is strong enough to prove exponential lower bounds for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Log.
دوره 62 شماره
صفحات -
تاریخ انتشار 1997